Inductive Definitions Over Finite Structures
نویسنده
چکیده
We give a simple proof of a theorem of Gurevich and Shelah, that the inductive closure of an inflationary operator is equivalent, over the class of finite structures, to the inductive closure (i.e. minimal fixpoint) of a positive operator. A variant of the same proof establishes a theorem of Immerman, that the class of inductive closures of positive first order operators is closed under complementation. Research partially supported by ONR grant N00014-84-K-0415 and by DARPA grant F33615-87-C-1499, ARPA Order 4976, Amendment 20. The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of ONR, DARPA, or the U.S. Government. Inductive definitions over finite structures Daniel Leivant Carnegie-Mellon University
منابع مشابه
The Power of the Depth of Iteration in Defining Relations by Induction
Student Name: Amena Assem Abd-AlQader Mahmoud. Title of the Thesis: The Power of the Depth of Iteration in Defining Relations by Induction. Degree: M.Sc. (Pure Mathematics). In this thesis we study inductive definitions over finite structures, particularly, the depth of inductive definitions. We also study infinitary finite variable logic which contains fixed-point logic and we introduce a new ...
متن کاملOn the complexity of inductive definitions
We study the complexity of computable and Σ1 inductive definitions of sets of natural numbers. For we example, we show how to assign natural indices to monotone Σ1-definitions and we use these to calculate the complexity of the set of all indices of monotone Σ1-definitions which are computable. We also examine the complexity of a new type of inductive definition which we call weakly finitary mo...
متن کاملFunctional interpretation and inductive definitions
Extending Gödel’s Dialectica interpretation, we provide a functional interpretation of classical theories of positive arithmetic inductive definitions, reducing them to theories of finite-type functionals defined using transfinite recursion on well-founded trees.
متن کاملThe finite stages of inductive definitions
In general, the least fixed point of a positive elementary inductive definition over the Herbrand universe is Π 1 and has no computational meaning. The finite stages, however, are computable, since validity of equality formulas in the Herbrand universe is decidable. We set up a formal system BID for the finite stages of positive elementary inductive definitions over the Herbrand universe and sh...
متن کاملBi-inductive structural semantics
We propose a simple order-theoretic generalization, possibly non monotone, of settheoretic inductive definitions. This generalization covers inductive, co-inductive and bi-inductive definitions and is preserved by abstraction. This allows structural operational semantics to describe simultaneously the finite/terminating and infinite/diverging behaviors of programs. This is illustrated on gramma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 89 شماره
صفحات -
تاریخ انتشار 1990